A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
نویسندگان
چکیده
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for high latency message-passing libraries. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for the original graph by projecting and refining the partition to successively finer graphs (uncoarsening phase). Our algorithm is able to achieve a high degree of concurrency, while maintaining the high quality partitions produced by the serial algorithm.
منابع مشابه
Par kway 2.0: A Parallel Multilevel Hypergraph Partitioning Tool
We recently proposed a coarse-grained parallel multilevel algorithm for the k-way hypergraph partitioning problem. This paper presents a formal analysis of the algorithm’s scalability in terms of its isoefficiency function, describes its implementation in the Parkway 2.0 tool and provides a run-time and partition quality comparison with stateof-the-art serial hypergraph partitioners. The isoeff...
متن کاملParallel Multilevel Algorithms for Multi-Constraint Graph Partitioning
Sequential multi-constraint graph partitioning algorithms have been developed to address the load balancing requirements of multi-phase simulations. The e cient execution of large multi-phase simulations on high performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a recently developed multi-constr...
متن کاملA New Method, the Fusion Fission, for the Relaxed k -way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms
In this paper a new graph partitioning problem is introduced, the relaxed k-way graph partitioning problem. It is close to the k-way, also called multi-way, graph partitioning problem, but with relaxed imbalance constraints. This problem arises in the air traffic control area. A new graph partitioning method is presented, the Fusion Fission, which can be used to resolve the relaxed k-way graph ...
متن کاملA Novel Adaptive Match Scheme for Parallel Mesh-decomposition in OpenFOAM
A parallel multilevel k-way partitioning algorithm is used in OpenFOAM to perform parallel mesh-decomposition. Before the parallel decomposition procedure, mesh has to be pre-decomposed by the Simple method in OpenFOAM. Matchcomputation for the algorithm’s parallel coarsening phase is based on a kind of global match scheme which introduces large amount of communication overhead. However, the do...
متن کاملParallel Multilevel Graph Partitioning
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 p...
متن کامل